Characterizing PAC-Learnability of Semilinear Sets
نویسندگان
چکیده
منابع مشابه
Characterizing PAC-Learnability of Semilinear Sets
The learnability of the class of letter-counts of regular languages (semilinear sets) and other related classes of subsets of N d with respect to the distribution-free learning model of Valiant (PAC-learning model) is characterized. Using the notion of reducibility among learning problems due to Pitt and Warmuth called \prediction preserving reducibility," and a special case thereof, a number o...
متن کاملThe PAC - learnability of Planning
In 6] Natarajan presented a framework for the speedup learning of search algorithms. Speedup learning solves the problem of using teacher-provided examples to guide the improvement of algorithm eeciency. In this paper we extend their results by identifying two classes, the emonomial and emonotonic domains. We show that, in the Natarajan model, the speedup learning problem is solvable for the se...
متن کاملThe Pac-Learnability of Recursive Logic Programs
We analyze the learnability of function-free recursive logic programs in the models of polynomial predictability and identiication from equivalence queries. Our ultimate goal is delineating the boundaries of eecient learnability for recursive logic programs. In the rst portion of the paper, we describe a restricted class of recursive programs that is learnable from equivalence queries alone. Th...
متن کاملExploring Learnability between Exact and PAC
We study a model of Probably Exactly Correct (PExact) learning that can be viewed either as the Exact model (learning from Equivalence Queries only) relaxed so that counterexamples to equivalence queries are distributionally drawn rather than adversarially chosen or as the Probably Approximately Correct (PAC) model strengthened to require a perfect hypothesis. We also introduce a model of Proba...
متن کاملLecture 4: Towards Characterizing Learnability
In this lecture, we introduce the notion of the growth function corresponding to a hypothesis class. This is the key notion that allows us to prove the learnability of infinite hypothesis classes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1006